Smooth surface interpolation to scattered data using interpolatory subdivision algorithms
نویسندگان
چکیده
منابع مشابه
Thinning algorithms for scattered data interpolation
Multistep interpolation of scattered data by compactly supported radial basis functions requires hierarchical subsets of the data. This paper analyzes thinning algorithms for generating evenly distributed subsets of scattered data in a given domain in IR. AMS subject classification: 41A15, 65D05, 65D07.
متن کاملScattered data approximation of fully fuzzy data by quasi-interpolation
Fuzzy quasi-interpolations help to reduce the complexity of solving a linear system of equations compared with fuzzy interpolations. Almost all fuzzy quasi-interpolations are focused on the form of $widetilde{f}^{*}:mathbb{R}rightarrow F(mathbb{R})$ or $widetilde{f}^{*}:F(mathbb{R})rightarrow mathbb{R}$. In this paper, we intend to offer a novel fuzzy radial basis function by the concept of so...
متن کاملA Subdivision Scheme for Smooth Interpolation of Quad-Mesh Data
A simple interpolatory subdivision scheme for quadrilateral nets with arbitrary topology is presented which generates C1 surfaces in the limit. The scheme satisfies important requirements for practical applications in computer graphics and engineering. These requirements include the necessity to generate smooth surfaces with local creases and cusps. The scheme can be applied to open nets in whi...
متن کاملHermite-interpolatory subdivision schemes
Stationary interpolatory subdivision schemes for Hermite data that consist of function values and first derivatives are examined. A general class of Hermite-interpolatory subdivision schemes is proposed, and some of its basic properties are stated. The goal is to characterise and construct certain classes of nonlinear (and linear) Hermite schemes. For linear Hermite subdivision, smoothness cond...
متن کاملInterpolatory sqrt(3)-Subdivision
We present a new interpolatory subdivision scheme for triangle meshes. Instead of splitting each edge and performing a 1-to-4 split for every triangle we compute a new vertex for every triangle and retriangulate the old and the new vertices. Using this refinement operator the number of triangles only triples in each step. New vertices are computed with a Butterfly like scheme. In order to obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1996
ISSN: 0898-1221
DOI: 10.1016/0898-1221(96)00115-0